package luogu;

import java.util.Scanner;

public class Main14 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        int[] arr = new int[26];
        //统计每个字母出现的次数
        for (char c : s.toCharArray()){
            arr[c - 'a']++;
        }
        //找出最大和最小出现的次数
        int max = 0;
        int min = Integer.MAX_VALUE;
        for (int i : arr) {
            //只考虑出现过的字母
            if (i>0){
                if (i > max){
                    max = i;
                }
                if (i < min){
                    min = i;
                }
            }
        }
        //计算差值并判断是否为质数
        int diff = max - min ;
        boolean isPrime = isPrimeNumber(diff);
        if (diff>1&&isPrime){
            System.out.println("Lucky Word");
            System.out.println(diff);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }

    private static boolean isPrimeNumber(int diff) {
        if (diff<2){
            return false;
        }
        if (diff==2){
            return true;
        }
        if (diff%2==0){
            return false;
        }
        for (int i = 3; i *i<=diff ; i+=2) {
            if (diff%i==0){
                return false;
            }
        }
        return true;
    }
}
